Towards Combining Model Checking and Proof Checking

SCTL: Towards Combining Model Checking and Proof Checking

Model checking and automated theorem proving are two pillars of formal methods. This paper investigates model checking from an automated theorem proving perspective, aiming at combining the expressiveness of automated theorem proving and the complete automaticity of model checking. The focus of this paper is on the verification of the temporal logic properties of Kripke models. The properties a...

Towards Lean Proof Checking

Logical formal systems are ineecient at computations. In order to increase their eeciency, we aim to extend these systems with computational power. In this paper, we suggest a general, powerful syntax, called oracle types, to extend type theories with computational power; the resulting systems, which combine the logical abilities of logical formal systems and the computational power of term rew...

PVS : Combining Speci cation , Proof Checking , and Model Checking ? To appear in CAV ' 96

PVS (Prototype Veriication System) is an environment for constructing clear and precise speciications and for developing readable proofs that have been mechanically veriied. It is designed to exploit the synergies between language and deduction, automation and interaction, and theorem proving and model checking. For example, the type system of PVS requires the use of theorem proving to establis...

Combining Model Checking and Testing

Model checking and testing have a lot in common. Over the last two decades, significant progress has been made on how to broaden the scope of model checking from finite-state abstractions to actual software implementations. One way to do this consists of adapting model checking into a form of systematic testing that is applicable to industrial-size software. This chapter presents an overview of...

Proof Checking and Approximation: towards Tight Results